Evolutionary Algorithms for Multiperiod Arc Routing Problems
نویسندگان
چکیده
The Capacitated Arc Routing Problem (CARP) is useful for modeling urban waste collection or winter gritting, at the operational decision level. Many applications require a tactical version, the periodic CARP (PCARP), in which the trips are planned over a multiperiod horizon, subject to frequency constraints. The paper presents this new and hard theoretical problem, its variants, and a powerful genetic algorithm (GA) tackling the tactical and operational levels in parallel. Preliminary tests with the GA show important savings compared to one constructive heuristic and another method that assigns tasks to periods before solving the CARP in each period.
منابع مشابه
Evolutionary Algorithms for Capacitated Arc Routing problems with Time Windows
The Capacitated Arc Routing Problem (CARP) involves vehicles routing, serving a set of arcs in a network. This NP hard problem is extended to take into account time windows, entailing a new and hard theoretical model in arc routing called the CARPTW (CARP with time windows). The CARPTW is useful for modeling urban waste collection or winter gritting. This paper presents this new model and a mem...
متن کاملAn Improved Decomposition-Based Memetic Algorithm for Multi-Objective Capacitated Arc Routing Problem
The Capacitated Arc Routing Problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and meta-heuristic approaches, including evolutionary algorithms. However, almost all such attempts formulate CARP as a single-objective problem altho...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملCompetitive Memetic Algorithms for Arc Routing Problems
Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Abstract The Capacitated Arc Routing Problem or CARP arises in applications like waste collection or winter gritting. Metaheuristics are tools of choice for solving large instances of this NP-hard problem. The paper presents basic components tha...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کامل